Almost Given Length Cycles in Digraphs
نویسنده
چکیده
A digraph is called k-cyclic if it cannot be made acyclic by removing less than k arcs. It is proved that for every > 0 there are constants K and δ so that for every d ∈ (0, δn), every n2-cyclic digraph with n vertices contains a directed cycle whose length is between d and d+K. A more general result of the same form is obtained for blow-ups of directed cycles.
منابع مشابه
Vertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملImproved Distance Queries and Cycle Counting by Frobenius Normal Form
Consider an unweighted, directed graph G with the diameter D. In this paper, we introduce the framework for counting cycles and walks of given length in matrix multiplication time Õ(n). The framework is based on the fast decomposition into Frobenius normal form and the Hankel matrix-vector multiplication. It allows us to solve the following problems efficiently: All Nodes Shortest Cycles – for ...
متن کاملDirected Graphs Without Short Cycles
For a directed graph G without loops or parallel edges, let β(G) denote the size of the smallest feedback arc set, i.e., the smallest subset X ⊂ E(G) such that G \X has no directed cycles. Let γ(G) be the number of unordered pairs of vertices of G which are not adjacent. We prove that every directed graph whose shortest directed cycle has length at least r ≥ 4 satisfies β(G) ≤ cγ(G)/r, where c ...
متن کاملHighly Arc-Transitive Digraphs With No Homomorphism Onto Z
In an in nite digraph D an edge e is reachable from an edge e if there exists an alternating walk in D whose initial and terminal edges are e and e Reachability is an equivalence relation and if D is arc transitive then this relation is either universal or all of its equiv alence classes induce isomorphic bipartite digraphs In Question Cameron Praeger and Wormald asked if there exist highly arc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 24 شماره
صفحات -
تاریخ انتشار 2008